Efficient algorithms for clone items detection
نویسندگان
چکیده
This paper presents efficient algorithms for clone items detection in a binary relation. Best implementation of these algorithms has O(|J |.||M||) time complexity, with J corresponding to the set of items of the relation and ||M|| corresponding to the size of the relation. This result improves the previous algorithm given in [3] which is O(|J |.||M||). Clone items have been introduced by Medina and Nourine to explain why, sometimes, the number of rules of a minimum cover of a relation is exponential with the number of items of the relation.
منابع مشابه
Introducing An Efficient Set of High Spatial Resolution Images of Urban Areas to Evaluate Building Detection Algorithms
The present work aims to introduce an efficient set of high spatial resolution (HSR) images in order to more fairly evaluate building detection algorithms. The introduced images are chosen from two recent HSR sensors (QuickBird and GeoEye-1) and based on several challenges of urban areas encountered in building detection such as diversity in building density, building dissociation, building sha...
متن کاملAccurate and Efficient Structural Characteristic Feature Extraction for Clone Detection
Structure-oriented approaches in clone detection have become popular in both code-based and model-based clone detection. However, existing methods for capturing structural information in software artifacts are either too computationally expensive to be efficient or too light-weight to be accurate in clone detection. In this paper, we present Exas, an accurate and efficient structural characteri...
متن کاملMOBILITY BASED ALGORITHMS FOR DETECTION OF CLONE NODES IN MOBILE SENSOR NETWORKS 1Benazir Banu, (M
Sensor networks are composed of a number of sensor nodes with limited resources and used in application such as environment monitoring and object tracking. This allows a situation where the adversary can compromise one sensor node, fabricate many replicas having the same identity (ID) from the captured node, and place these replicas back into strategic positions in the network for further malic...
متن کاملKClone: A Proposed Approach to Fast Precise Code Clone Detection
In all applications of clone detection it is important to have precise and efficient clone identification algorithms. This paper proposes and outlines a new algorithm, KClone for clone detection that incorporates a novel combination of lexical and local dependence analysis to achieve precision, while retaining speed. The paper also reports on the initial results of a case study using an impleme...
متن کاملA Technique for Identifying and Testing Structural Clones in Large Scale Systems
Clones have played an important role in increasing the software’s maintenance and decreasing the quality. Hence detecting the clones and removing them has been an interesting scenario. Detecting clones not only improves the productivity of software but also enhances re-usability. A number of techniques were presented in the past but they have had there own drawbacks. Efficient algorithms are cr...
متن کامل